/*
*	ID : Pallab
* 	PROG : B
* 	LANG : C++
* 	2012-12-10-14.23.35 Monday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <array>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait(double seconds) {
        double endtime = clock() + (seconds * CLOCKS_PER_SEC);
        while (clock() < endtime) {
                ;
        }
}
template<class T>
inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while(c<33)c=getchar();
    while(c>33) {
        if(c=='-') {
            neg=true;
        } else {
            a= (a*10)+(c-'0');
        }
        c=getchar();
    }
    return neg?-a:a;
}
const int MX=600;
const int sz=12;
int result[MX];
int M[]={31,28,31,30,31,30,31,31,30,31,30,31};
inline void read(){}
inline void proc(){
    int n=fastIn<int>();
    fo(i,n){
        int mn=fastIn<int>(),da=fastIn<int>();
        int pi=fastIn<int>(),ti=fastIn<int>();
        int day_count=0;
        for(int j=0;j<mn-1;++j)day_count+=M[j];
        day_count+=da;
        foE(j,1,ti){
            --day_count;
            result[day_count+120]+=pi;
        }
    }
    cout<<*max_element(result,result+MX)<<"\n";
}
int main() {
        int kase = 1;
#if defined( xerxes_pc )
        if (!freopen("in1", "r", stdin))
                puts("error opening file in "), assert(0);
        kase = 1;
#else
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
#endif
        fo(i,kase){
                read();
                proc();
        }
        return 0;
}
